Recovery of Block-Structured Sparse Signal Using Block-Sparse Adaptive Algorithms via Dynamic Grouping

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simultaneous Block-Sparse Signal Recovery Using Pattern-Coupled Sparse Bayesian Learning

In this paper, we consider the block-sparse signals recovery problem in the context of multiple measurement vectors (MMV) with common row sparsity patterns. We develop a new method for recovery of common row sparsity MMV signals, where a pattern-coupled hierarchical Gaussian prior model is introduced to characterize both the block-sparsity of the coefficients and the statistical dependency betw...

متن کامل

Sparse signal recovery using sparse random projections

Sparse signal recovery using sparse random projections

متن کامل

Person re-identification with block sparse recovery

We consider the problem of automatically re-identifying a person of interest seen in a “probe” camera view among several candidate people in a “gallery” camera view. This problem, called person re-identification, is of fundamental importance in several video analytics applications. While extracting knowledge from high-dimensional visual representations based on the notions of sparsity and regul...

متن کامل

Improved Algorithms For Structured Sparse Recovery

It is known that certain structures of the signal in addition to the standard notion of sparsity (called structured sparsity) can improve the sample complexity in several compressive sensing applications. Recently, Hegde et al. [17] proposed a framework, called approximation-tolerant model-based compressive sensing, for recovering signals with structured sparsity. Their framework requires two o...

متن کامل

Speaker Recognition via Block Sparse Bayesian Learning

In order to demonstrate the effectiveness of sparse representation techniques for speaker recognition, a dictionary of feature vectors belonging to all speakers is constructed by total variability i-vectors. Each feature vector from unknown utterance is expressed as linear weighted sum of a dictionary. The weights are calculated using Block Sparse Bayesian Learning (BSBL) where the sparsest sol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2018

ISSN: 2169-3536

DOI: 10.1109/access.2018.2872671